A Generalized Deadlock-Free Process Calculus

An Implicitly-Typed Deadlock-Free Process Calculus

We extend Kobayashi and Sumii's type system for the deadlock-free -calculus and develop a type reconstruction algorithm. Kobayashi and Sumii's type system helps high-level reasoning about concurrent programs by guaranteeing that communication on certain channels will eventually succeed. It can ensure, for example, that a process implementing a function really behaves like a function. However, b...

A Partially Deadlock - free Typed Process Calculus ( II )

We propose a novel static type system for a process calculus, which ensures both partial deadlock-freedom and partial con uence. The key novel ideas are (1) introduction of order of channel use as type information, and (2) classi cation of communication channels into reliable and unreliable channels based on their usage, with a guarantee of the usage by the type system. We can ensure that commu...

A Partially Deadlock - free Typed Process Calculus ( I ) { A Simple System

Concurrency primitives play an important role in describing programs on parallel/distributed environments and also in writing interactive programs. Theoretical supports for concurrency primitives, however, have so far been very limited. Several type systems have been recently proposed through process calculi, but most of them do not solve inherent problems in concurrent programs: deadlock and n...

Deadlock-Free Parallel Processing

Deadlock-free Connguration Programming

The connguration programming approach has been successfully applied to model parallel and distributed systems in terms of their component processes and relationships, separated from the functional aspects of the components' behaviour. This approach promotes the construction of modular and exible systems but the lack of information about the components' behaviour prevents us verifying important ...